An Approximation for the Kth Nearest Distance and Its Application to Locational Analysis
نویسنده
چکیده
In this paper, we provide a simple approximation for the distance from an arbitrary location to the kth nearest point. Distance is measured as the Euclidean and the rectilinear distances on a continuous plane. The approximation demonstrates that the kth nearest distance is proportional to the square root of k and inversely proportional to the square root of the density of points. The accuracy of the approximation is assessed for regular and random point patterns. Comparing the approximation with road network distances shows that the approximation on a continuous plane can be used for estimating the kth nearest distance on actual road networks. As an application of the approximation to locational analysis, we obtain the average distance to the nearest open facility when some of the existing facilities are closed.
منابع مشابه
Analysis of Facility Location Using Ordered Rectilinear Distance in Regular Point Patterns
This paper deals with the kth nearest rectilinear distance of two regular point patterns: square and diamond lattices. The probability density functions of the kth nearest rectilinear distance are theoretically derived for k = 1, 2, . . . , 8. Upper and lower bounds of the kth nearest distance are also derived. As an application of the kth nearest distance, we consider a facility location probl...
متن کاملA Fuzzy C-means Algorithm for Clustering Fuzzy Data and Its Application in Clustering Incomplete Data
The fuzzy c-means clustering algorithm is a useful tool for clustering; but it is convenient only for crisp complete data. In this article, an enhancement of the algorithm is proposed which is suitable for clustering trapezoidal fuzzy data. A linear ranking function is used to define a distance for trapezoidal fuzzy data. Then, as an application, a method based on the proposed algorithm is pres...
متن کاملkth Nearest Neighbor Sampling in the Plane
Let B be a square region in the plane. We give an efficient algorithm that takes a set P of n points from B, and produces a set M ⊂ B with the property that the distance to the second nearest point in M approximates the distance to the kth nearest point of P . That is, there are constants α, β ∈ R such that for all x ∈ B, we have αdP,k(x) ≤ dM,2(x) ≤ βdP,k(x), where dM,2 and dP,k denote the sec...
متن کاملFast Approximation of High-Order Voronoi Diagrams and Distance Transforms on the GPU
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and efficient implementation of this algorithm using graphics hardware is possible only with the use of an appropriate shader program on the GPU. This is achieved by rendering in k passes the parallel projection of the top k lev...
متن کاملOptimum Locational Analysis Regarding Border Markets Located in Villages of Gonbad Kuvoos
Introduction: Achievement of rural development as a way to maintain national security and identity requires extra efforts regarding deprivation issue in backward regions and makes them receive their development rights. Economic development paves the way for creation of optimum and thriving life space. It is argued that physical isolation, potential economic and physical incapability, and rem...
متن کامل